Linear Tail-Biting Trellis and Its Sectionalization
نویسندگان
چکیده
In this paper, we discuss the sectionalization in linear tail-biting trellis. In [3], Lafourcade and Vardy investigated the basic property of sectionalization in conventional trellis. Their proofs of basic properties are based on conventional trellis structure which fails to be generalized to linear tail-biting trellis. We derive our proofs from the construction of Koetter-Vardy(KV) trellis in [1]. All properties of sectionalization in conventional trellis are preserved in linear tail-biting trellis. Especially, we prove the necessary condition of an optimal sectionalization in linear tail-biting trellis.
منابع مشابه
The structure of tail-biting trellises: minimality and basic principl
Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by e...
متن کاملTail-Biting Trellises of Block Codes: Trellis Complexity and Viterbi Decoding Complexity
Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information be...
متن کاملTail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملOn the Theory of Linear Trellises
Trellis linearity, rst considered by McEliece in 1996, turns out to be crucial in the study of tail-biting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous deeni-tion of linearity is given for both conventional and tail-biting trellises. An algorithm that determines in polynomial time whether a given trellis is linear is then derived. The ...
متن کاملTail-Biting Trellis Realizations and Local Reductions
This paper investigates tail-biting trellis realizations for linear block codes. By considering the trellis and its dual simultaneously, a characterization for irreducibility on given intervals of the time axis is given, and a constructive reduction procedure is presented. For fragments of length less than the minimum span length of the code, the criterion amounts to fragment observability and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 33 شماره
صفحات -
تاریخ انتشار 2017